A Decidable Characterization of a Graphical Pi-calculus with Iterators

نویسندگان

  • Frédéric Peschanski
  • Hanna Klaudel
  • Raymond R. Devillers
چکیده

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilarity is decidable for the proposed semantics, a result obtained thanks to an original notion of causal clock as well as the automatic garbage collection of unused names.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$

Given a Πμ 2 formula of the modal μ calculus, it is decidable whether it is equivalent to a Σμ 2 formula.

متن کامل

A Graphical Characterization for SPAP-Rings

Let $R$ be a commutative ring and $I$ an ideal of $R$. The zero-divisor graph of $R$ with respect to $I$, denoted by $Gamma_I(R)$, is the simple graph whose vertex set is ${x in Rsetminus I mid xy in I$, for some $y in Rsetminus I}$, with two distinct vertices $x$ and $y$ are adjacent if and only if $xy in I$. In this paper, we state a relation between zero-divisor graph of $R$ with respec...

متن کامل

A Graphical Representation for the Stochastic Pi-Calculus

This paper presents a graphical representation for the stochastic pi-calculus, which builds on previous formal and informal notations. The graphical representation is used to model a Mapk signalling cascade and an evolved gene network. One of the main benefits of the representation is its ability to clearly highlight the existence of cycles, which are a key aspect of many biological systems. An...

متن کامل

An exercise in structural congruence

Milner’s structural congruence is decidable for the pi-calculus without restriction, in exponential space. © 2006 Elsevier B.V. All rights reserved.

متن کامل

Agent-Based Programming In Eiffel

The introduction into an object-oriented framework such as Eiffel of "agents", a higher-level functional abstraction, brings a whole new set of expressive possibilities. This tutorial will explain how to use agents in the best possible way and detail their application to a wide range of areas including: graphical programming; error handling; writing extensive contract specifications; numerical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010